A Data Hiding Method Based on Partition Variable Block Size with Exclusive-or Operation on Binary Image

In this paper, we propose a high capacity data hiding method applying in binary images. Since image has only two colors, black or white, it is hard to hide imperceptible. The capacities and imperception are always trade-off problem. Before embedding shuffle the secret by pseudo-random number generator keep more secure. We divide host into several non-overlapping (2n+1) sub-blocks an M N as many possible, where n can equal 1, 2, 3 , …, min(M,N). Then partition each sub-block four overlapping (n+1) sub-blocks. skip all blacks whites consider check XOR between non parts center pixel of sub-block, embed 2 bits totally 4*n . entire be embedded 4×n 2×M/(2n+1)×N/(2n+1) bits. extraction way simply test with their part sub-block. All collected shuffled back original order. adaptive means partitioning may affect that want select. experimental results show provides large keeps imperceptible reveal lossless.